Linear monads
نویسندگان
چکیده
منابع مشابه
Linear Logic, Monads and the Lambda Calculus
Models of intuitionistic linear logic also provide models of Moggi's computational metalanguage. We use the adjoint presentation of these models and the associated adjoint calculus to show that three translations , due mainly to Moggi, of the lambda calculus into the computational metalanguage (direct, call-by-name and call-by-value) correspond exactly to three translations , due mainly to Gira...
متن کاملTranslating Types and Effects with State Monads and Linear Logic
We study a lambda-calculus with references and a types and effects system. In the first part of the paper, we translate it into the ordinary lambda-calculus with products, implementing an interacting family of state monads localized at sets of regions. In general the target language must be endowed with recursive types. However we prove that the stratification condition on regions, already used...
متن کاملCorecursive Algebras, Corecursive Monads and Bloom Monads
An algebra is called corecursive if from every coalgebra a unique coalgebra-toalgebra homomorphism exists into it. We prove that free corecursive algebras are obtained as coproducts of the terminal coalgebra (considered as an algebra) and free algebras. The monad of free corecursive algebras is proved to be the free corecursive monad, where the concept of corecursive monad is a generalization o...
متن کاملCertification Monads
This entry provides several monads intended for the development of stand-alone certifiers via code generation from Isabelle/HOL. More specifically, there are three flavors of error monads (the sum type, for the case where all monadic functions are total; an instance of the former, the so called check monad, yielding either success without any further information or an error message; as well as ...
متن کاملElgot Monads
It was the idea of Calvin Elgot [4] to use Lawvere theories for the study of the semantics of recursion. He introduced iterative theories as those Lawvere theories in which every ideal morphism e : n → n+p (representing a system of recursive equations in n variables and p parameters) has a unique solution, i. e., a unique morphism e† such that the equation e† = [e†, idp] ·e holds. Elgot proved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1977
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700010418